On a crossroad of resampling plans: bootstrapping elementary symmetric polynomials
نویسندگان
چکیده
We investigate the validity of the bootstrap method for the elementary symmetric polynomials S both xed and increasing order k, as n ! 1 the cases where = EX 1 6 = 0, the nondegenerate case, and where = EX 1 = 0, the degenerate case, are considered.
منابع مشابه
When is the Algebra of Multisymmetric Polynomials Generated by the Elementary Multisymmetric Polynomials?
Multisymmetric polynomials are the r-fold diagonal invariants of the symmetric group Sn. Elementary multisymmetric polynomials are analogues of the elementary symmetric polynomials, in the multisymmetric setting. In this paper, we give a necessary and sufficient condition on a ring A for the algebra of multisymmetric polynomials with coefficients in A to be generated by the elementary multisymm...
متن کاملBuckling and vibration analysis of angle -ply symmetric laminated composite plates with fully elastic boundaries
The main focus of this paper is on efficiency analysis of two kinds of approximating functions (characteristic orthogonal polynomials and characteristic beam functions) that have been applied in the Rayleigh-Ritz method to determine the non-dimensional buckling and frequency parameters of an angle ply symmetric laminated composite plate with fully elastic boundaries. It has been observed that o...
متن کاملOn hyperbolicity cones associated with elementary symmetric polynomials
Elementary symmetric polynomials can be thought of as derivative polynomials of En(x) = ∏ i=1,...,n xi. Their associated hyperbolicity cones give a natural sequence of relaxations for R+. We establish a recursive structure for these cones, namely, that the coordinate projections of these cones are themselves hyperbolicity cones associated with elementary symmetric polynomials. As a consequence ...
متن کاملEvaluation Properties of Symmetric Polynomials
By the fundamental theorem of symmetric polynomials, if P ∈ Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(σ1, . . . , σn), where σ1, . . . , σn are the elementary symmetric polynomials in n variables, and Q is in Q[S1, . . . , Sn]. We investigate the complexity properties of this construction in the straight-line program model, showing that the complexity of evaluation of Q depen...
متن کاملOn closed form calculation of line spectral frequencies (LSF)
The mathematical theory of closed form functions for calculating LSFs on the basis of generating functions is presented. Exploiting recurrence relationships in the series expansion of Chebyshev polynomials of the first kind makes it possible to bootstrap iterative LSF-search from a set of characteristic polynomial zeros. The theoretical analysis is based on decomposition of sequences into symme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997